|
In the theory of computation, a Moore machine is a finite-state machine whose output values are determined solely by its current state. This is in contrast to a Mealy machine, whose output values are determined both by its current state and by the values of its inputs. The Moore machine is named after Edward F. Moore, who presented the concept in a 1956 paper, “Gedanken-experiments on Sequential Machines.” == Formal definition == A Moore machine can be defined as a 6-tuple consisting of the following: * a finite set of states * a start state (also called initial state) which is an element of * a finite set called the input alphabet * a finite set called the output alphabet * a transition function mapping a state and the input alphabet to the next state * an output function mapping each state to the output alphabet A Moore machine can be regarded as a restricted type of finite state transducer. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Moore machine」の詳細全文を読む スポンサード リンク
|